منابع مشابه
From scale-free to Erdos-Rényi networks.
We analyze a model that interpolates between scale-free and Erdos-Rényi networks. The model introduced generates a one-parameter family of networks and allows one to analyze the role of structural heterogeneity. Analytical calculations are compared with extensive numerical simulations in order to describe the transition between these two important classes of networks. Finally, an application of...
متن کاملErdos and Rényi Conjecture
Affirming a conjecture of Erdös and Rényi we prove that for any (real number) c1 > 0 for some c2 > 0, if a graph G has no c1(log n) nodes on which the graph is complete or edgeless (i.e. G exemplifies |G| 9 (c1 log n)22) then G has at least 22 non-isomorphic (induced) subgraphs. Latest Revision 97/Aug/14 I thank Alice Leonhardt for the beautiful typing Typeset by AMS-TEX 1 6 2 7 r e v i s i o n...
متن کاملRandom sequential renormalization and agglomerative percolation in networks: application to Erdös-Rényi and scale-free graphs.
We study the statistical behavior under random sequential renormalization (RSR) of several network models including Erdös-Rényi (ER) graphs, scale-free networks, and an annealed model related to ER graphs. In RSR the network is locally coarse grained by choosing at each renormalization step a node at random and joining it to all its neighbors. Compared to previous (quasi-)parallel renormalizati...
متن کاملCrossover from scale-free to spatial networks
– In many networks such as transportation or communication networks, distance is certainly a relevant parameter. In addition, real-world examples suggest that when long-range links are existing, they usually connect to hubs —the well-connected nodes. We analyze a simple model which combines both these ingredients —preferential attachment and distance selection characterized by a typical finite ...
متن کاملVariance of the subgraph count for sparse Erdos-Rényi graphs
We develop formulas for the variance of the number of copies of a small subgraph H in the Erdős-Rényi random graph. The central technique employs a graph overlay polynomial encoding subgraph symmetries, which is of independent interest, that counts the number of copies H̃ ∼= H overlapping H. In the sparse case, building on previous results of Janson, Luczak, and Rucinski allows restriction of th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review E
سال: 2006
ISSN: 1539-3755,1550-2376
DOI: 10.1103/physreve.73.056124